The Extrapolated Taylor Model

نویسندگان

  • Paluri S. V. Nataraj
  • Shanta Sondur
چکیده

The Taylor model [8] is one of the inclusion functions available to compute the range enclosures. It has the property of (m+ 1) convergence order, where, m is the order of the Taylor model used. It computes a high order polynomial approximation to a multivariate Taylor expansion, with a remainder term that rigorously bound the approximation error. The sharper bounds on the enclosures computed using the Taylor model can be obtained either by successively partitioning the domain x using suitable subdivision factors, or by increasing the convergence rate of the Taylor model using higher order Taylor models. However, higher order Taylor forms require higher degrees of the polynomial part, which in turn require more computational effort and more memory. This is the major drawback of increasing the order m of Taylor models for obtaining range enclosures with higher order convergence rates. In this paper, we attempt to overcome these drawbacks by using a lower order Taylor model, and then using extrapolation to accelerate the convergence process of the sequences generated with the lower order Taylor model. The effectiveness of all the proposed algorithms is tested on various multivariate examples and compared with the conventional methods. The test results show that the proposed extrapolation-based methods offer considerable speed improvements over the conventional methods.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Taylor Rule: A Model for the Mechanism of Monetary Policy and Inflation Control in the Framework of the Interest-Free Banking Act

The ultimate goal of monetary policy is to achieve price stability and high output. In this regard, central banks usually change the interest rate, liquidity, and money base in order to apply monetary policies. The John B. Taylor rule is one of the rules known in the transmission of monetary policy.[1] Based on this rule and given the output gap and inflation gap, the central bank increases or ...

متن کامل

External and Internal Incompressible Viscous Flows Computation using Taylor Series Expansion and Least Square based Lattice Boltzmann Method

The lattice Boltzmann method (LBM) has recently become an alternative and promising computational fluid dynamics approach for simulating complex fluid flows. Despite its enormous success in many practical applications, the standard LBM is restricted to the lattice uniformity in the physical space. This is the main drawback of the standard LBM for flow problems with complex geometry. Several app...

متن کامل

Numerical solution for the risk of transmission of some novel coronavirus (2019-nCov) models by the Newton-Taylor polynomial solutions

In this paper we consider two type of mathematical models for the novel coronavirus (2019-nCov), which are in the form of a nonlinear differential equations system. In the first model the contact rate, , and transition rate of  symptomatic infected indeviduals to the quarantined infected class, , are constant. And in the second model these quantities are time dependent. These models are the...

متن کامل

Reconnoitering the effective Channels of Monetary Transmission Mechanism in Iran Using a Dynamic Stochastic General Equilibrium Model

The purpose of the present research is to investigate the effective channels of the monetary transmission mechanism in Iran. To do so, we devised a New Keynesian Dynamic Stochastic General Equilibrium Model. In our model, the different types of nominal rigidities are introduced beside all the related structural equations, which are extracted and linearized around a steady state point. Furthermo...

متن کامل

Presentation and Solving Non-Linear Quad-Level Programming Problem Utilizing a Heuristic Approach Based on Taylor Theorem

The multi-level programming problems are attractive for many researchers because of their application in several areas such as economic, traffic, finance, management, transportation, information technology, engineering and so on. It has been proven that even the general bi-level programming problem is an NP-hard problem, so the multi-level problems are practical and complicated problems therefo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Reliable Computing

دوره 15  شماره 

صفحات  -

تاریخ انتشار 2011